The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

rev(nil) → nil
rev(rev(x)) → x
rev(++(x, y)) → ++(rev(y), rev(x))
++(nil, y) → y
++(x, nil) → x
++(.(x, y), z) → .(x, ++(y, z))
++(x, ++(y, z)) → ++(++(x, y), z)
make(x) → .(x, nil)

Rewrite Strategy: INNERMOST

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

rev(nil) → nil
rev(rev(x)) → x
rev(++(x, y)) → ++(rev(y), rev(x))
++(nil, y) → y
++(x, nil) → x
++(.(x, y), z) → .(x, ++(y, z))
++(x, ++(y, z)) → ++(++(x, y), z)
make(x) → .(x, nil)

S is empty.
Rewrite Strategy: INNERMOST

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(4) Obligation:

Innermost TRS:
Rules:
rev(nil) → nil
rev(rev(x)) → x
rev(++(x, y)) → ++(rev(y), rev(x))
++(nil, y) → y
++(x, nil) → x
++(.(x, y), z) → .(x, ++(y, z))
++(x, ++(y, z)) → ++(++(x, y), z)
make(x) → .(x, nil)

Types:
rev :: nil:. → nil:.
nil :: nil:.
++ :: nil:. → nil:. → nil:.
. :: a → nil:. → nil:.
make :: a → nil:.
hole_nil:.1_0 :: nil:.
hole_a2_0 :: a
gen_nil:.3_0 :: Nat → nil:.

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
rev, ++

They will be analysed ascendingly in the following order:
++ < rev

(6) Obligation:

Innermost TRS:
Rules:
rev(nil) → nil
rev(rev(x)) → x
rev(++(x, y)) → ++(rev(y), rev(x))
++(nil, y) → y
++(x, nil) → x
++(.(x, y), z) → .(x, ++(y, z))
++(x, ++(y, z)) → ++(++(x, y), z)
make(x) → .(x, nil)

Types:
rev :: nil:. → nil:.
nil :: nil:.
++ :: nil:. → nil:. → nil:.
. :: a → nil:. → nil:.
make :: a → nil:.
hole_nil:.1_0 :: nil:.
hole_a2_0 :: a
gen_nil:.3_0 :: Nat → nil:.

Generator Equations:
gen_nil:.3_0(0) ⇔ nil
gen_nil:.3_0(+(x, 1)) ⇔ .(hole_a2_0, gen_nil:.3_0(x))

The following defined symbols remain to be analysed:
++, rev

They will be analysed ascendingly in the following order:
++ < rev

(7) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
++(gen_nil:.3_0(n5_0), gen_nil:.3_0(b)) → gen_nil:.3_0(+(n5_0, b)), rt ∈ Ω(1 + n5₀)

Induction Base:
++(gen_nil:.3_0(0), gen_nil:.3_0(b)) →_R^Ω(1)
gen_nil:.3_0(b)

Induction Step:
++(gen_nil:.3_0(+(n5_0, 1)), gen_nil:.3_0(b)) →_R^Ω(1)
.(hole_a2_0, ++(gen_nil:.3_0(n5_0), gen_nil:.3_0(b))) →_IH
.(hole_a2_0, gen_nil:.3_0(+(b, c6_0)))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(8) Complex Obligation (BEST)

(9) Obligation:

Innermost TRS:
Rules:
rev(nil) → nil
rev(rev(x)) → x
rev(++(x, y)) → ++(rev(y), rev(x))
++(nil, y) → y
++(x, nil) → x
++(.(x, y), z) → .(x, ++(y, z))
++(x, ++(y, z)) → ++(++(x, y), z)
make(x) → .(x, nil)

Types:
rev :: nil:. → nil:.
nil :: nil:.
++ :: nil:. → nil:. → nil:.
. :: a → nil:. → nil:.
make :: a → nil:.
hole_nil:.1_0 :: nil:.
hole_a2_0 :: a
gen_nil:.3_0 :: Nat → nil:.

Lemmas:
++(gen_nil:.3_0(n5_0), gen_nil:.3_0(b)) → gen_nil:.3_0(+(n5_0, b)), rt ∈ Ω(1 + n5₀)

Generator Equations:
gen_nil:.3_0(0) ⇔ nil
gen_nil:.3_0(+(x, 1)) ⇔ .(hole_a2_0, gen_nil:.3_0(x))

The following defined symbols remain to be analysed:
rev

(10) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol rev.

(11) Obligation:

Innermost TRS:
Rules:
rev(nil) → nil
rev(rev(x)) → x
rev(++(x, y)) → ++(rev(y), rev(x))
++(nil, y) → y
++(x, nil) → x
++(.(x, y), z) → .(x, ++(y, z))
++(x, ++(y, z)) → ++(++(x, y), z)
make(x) → .(x, nil)

Types:
rev :: nil:. → nil:.
nil :: nil:.
++ :: nil:. → nil:. → nil:.
. :: a → nil:. → nil:.
make :: a → nil:.
hole_nil:.1_0 :: nil:.
hole_a2_0 :: a
gen_nil:.3_0 :: Nat → nil:.

Lemmas:
++(gen_nil:.3_0(n5_0), gen_nil:.3_0(b)) → gen_nil:.3_0(+(n5_0, b)), rt ∈ Ω(1 + n5₀)

Generator Equations:
gen_nil:.3_0(0) ⇔ nil
gen_nil:.3_0(+(x, 1)) ⇔ .(hole_a2_0, gen_nil:.3_0(x))

No more defined symbols left to analyse.

(12) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
++(gen_nil:.3_0(n5_0), gen_nil:.3_0(b)) → gen_nil:.3_0(+(n5_0, b)), rt ∈ Ω(1 + n5₀)

(13) BOUNDS(n^1, INF)

(14) Obligation:

Innermost TRS:
Rules:
rev(nil) → nil
rev(rev(x)) → x
rev(++(x, y)) → ++(rev(y), rev(x))
++(nil, y) → y
++(x, nil) → x
++(.(x, y), z) → .(x, ++(y, z))
++(x, ++(y, z)) → ++(++(x, y), z)
make(x) → .(x, nil)

Types:
rev :: nil:. → nil:.
nil :: nil:.
++ :: nil:. → nil:. → nil:.
. :: a → nil:. → nil:.
make :: a → nil:.
hole_nil:.1_0 :: nil:.
hole_a2_0 :: a
gen_nil:.3_0 :: Nat → nil:.

Lemmas:
++(gen_nil:.3_0(n5_0), gen_nil:.3_0(b)) → gen_nil:.3_0(+(n5_0, b)), rt ∈ Ω(1 + n5₀)

Generator Equations:
gen_nil:.3_0(0) ⇔ nil
gen_nil:.3_0(+(x, 1)) ⇔ .(hole_a2_0, gen_nil:.3_0(x))

No more defined symbols left to analyse.

(15) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
++(gen_nil:.3_0(n5_0), gen_nil:.3_0(b)) → gen_nil:.3_0(+(n5_0, b)), rt ∈ Ω(1 + n5₀)

(16) BOUNDS(n^1, INF)